A Theorem Prover for ASTRAL

نویسنده

  • Paul Z. Kolano
چکیده

The ASTRAL real-time formal specification language has been encoded into the PVS theorem prover. A translator has been developed to completely translate any single-level ASTRAL specification into its corresponding PVS encoding. The semantics of the ASTRAL abstract machine have been revised and expanded for use with PVS. This paper describes the encoding and semantics and explains their use along with providing other possible applications of the encoding.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Assistance for Real-Time Systems Using an Interactive Theorem Prover

This paper discusses the adaptation of the PVS theorem prover for performing analysis of realtime systems written in the ASTRAL formal specification language. Several issues arose during the encoding of ASTRAL that are relevant to the encoding of many real-time specification languages such as encoding formulas as types, handling partial functions, dealing with noninterleaved concurrency, and de...

متن کامل

The Design and Analysis of Real-Time Systems Using the ASTRAL Software Development Environment

ASTRAL is a formal specification language for real-time systems. It is intended to support formal software development and, therefore, has been formally defined. The structuring mechanisms in ASTRAL allow one to build modularized specifications of complex systems with layering. A real-time system is modeled by a collection of state machine specifications and a single global specification. This ...

متن کامل

MSPASS: Modal Reasoning by Translation and First-Order Resolution

mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for the relational cal-

متن کامل

A Self-Modifying Theorem Prover

Theorem provers can be viewed as containing declarative knowledge (in the form of axioms and lemmas) and procedural knowledge (in the form of an algorithm for proving theorems). Sometimes, as in the case of commutative laws in a Knuth-Bendix prover, it is appropriate or necessary to transfer knowledge from one category to the other. We describe a theorem proving system that independently recogn...

متن کامل

SPEAR Theorem Prover

SPEAR is a modular arithmetic theorem prover designed for proving software verification conditions. The core of the theorem prover is a fast and simple SAT solver, which is described in this paper.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998